The Departure Process of a Discrete - Time Finite Capacity System with Correlated Arrivals Zhi
نویسندگان
چکیده
Queueing network models have proven to be very useful in the analysis of communication systems. The departure process of a queue in a queueing network is of special interest because it is the arrival process to other queues in the network. For high speed networks, correlation and burstiness are very important factors for system performance and thus the smooth Bernoulli process is no longer a good assumption for an arrival process of the network traffic in a discrete-time system. We have investigated the Markov Modulated Bernoulli process (MMBP), which can adequately capture the properties of both burstiness and correlation, as a model for the arrival processes of high speed network traffic. In this paper, the departure process of a discrete-time finite capacity queue, which has an MMBP arrival process, is derived. First, the MMBP /Geo/l/K queue is studied by using a multi-dimensional Markov chain. The MMBP /D /l/K queue, which is a special case, is also investigated. The queue length distributions and blocking probabilities for both systems are derived. Furthermore, the exact solution for the departure process of the MMBP /Geo/l/K queue is investigated by using the knowledge of the queue length distribution. The generating function of the interdeparture interval time and the first four moments of this quantity are obtained. Finally, the departure process was fitted to a two-state MMBP by using a four moments matching technique.
منابع مشابه
An Approach for Performance Analysis of Discrete-Time Finite Capacity Open Queuing Network with Correlated arrivals
Future high speed, broadband networks such as BISDN (Broadband Integrated Services Digital Network) support diverse applications like voice, video and data transfer. ATM (Asynchronous Transfer Mode) is considered to be the most promising transfer technology for implementing these networks. This paper presents a scheme, which may be used for the performance evaluation of ATM switching networks w...
متن کاملOn the relationships among queue lengths at arrival, departure, and random epochs in the discrete-time queue with D-BMAP arrivals
We consider finiteand infinite-capacity queues with discrete-time batch Markovian arrival processes (D-BMAP) under the assumption of the Late Arrival System with Delayed Access as well as the Early Arrival System. Using simple arguments such as the balance equation, “rate in = rate out,” we derive relationships among the stationary queue lengths at arrival, at departure, and at random epochs. S...
متن کاملAlgorithms for Computing Limit distributions of Oscillating Systems with Finite Capacity
We address the batch arrival systems with finite capacity under partial batch acceptance strategy where service times or rates oscillate between two forms according to the evolution of the number of customers in the system. Applying the theory of Markov regenerative processes and resorting to Markov chain embedding, we present a new algorithm for computing limit distributions of the number cus...
متن کاملDISCRETE-TIME GI/D-MSP/1/K QUEUE WITH N THRESHOLD POLICY
This paper presents a discrete-time single-server finite buffer N threshold policy queue with renewal input and discreteMarkovian service process. The server terminates service whenever the system becomes empty, and recommencesservice as soon as the number of waiting customers in the queue is N. We obtain the system-length distributionsat pre-arrival and arbitrary epochs using the supplementary...
متن کاملOptimal Finite-time Control of Positive Linear Discrete-time Systems
This paper considers solving optimization problem for linear discrete time systems such that closed-loop discrete-time system is positive (i.e., all of its state variables have non-negative values) and also finite-time stable. For this purpose, by considering a quadratic cost function, an optimal controller is designed such that in addition to minimizing the cost function, the positivity proper...
متن کامل